A multi-vessel quay crane assignment and scheduling problem: Formulation and heuristic solution approach

نویسندگان

  • Yi-Min Fu
  • Ali H. Diabat
  • I-Tsung Tsai
چکیده

Keywords: Quay crane assignment Quay crane scheduling Genetic algorithms Integrated models a b s t r a c t This paper presents a new approach to analyze the integrated quay crane assignment and scheduling problem (QCASP). The problem determines the assignment of quay cranes to vessels and the sequence of tasks to be processed by each quay crane simultaneously, and accounts for important considerations such as safety margins between quay cranes (QCs), ordering conditions and vessel priority. Furthermore, QCs can travel from one vessel to another vessel whenever tasks are complete. The integrated problem is difficult to solve with exact methods due to its complexity. Therefore, a genetic algorithm (GA) is proposed to solve the integrated QCASP. Computational results validate the performance of the proposed GA. International trade plays a crucial role in global economy and it relies heavily on maritime transport, which accounts for approximately 90% of global trade transport (International Chamber of Shipping, 2014). The continuous increase of maritime transport has led to the containerization of goods, which facilitates the growth of this sector, making it an even more important component of international trade. Ports and container terminals are vital nodes in the network as they accommodate the transshipment of goods and then connect them to the rest of the transport network. Fig. 1 shows that global container traffic, as measured in twenty-foot equivalent units (TEUs), has more than doubled between 2001 and 2010. Port operation involves a sequence of activities that require careful planning and execution to ensure maximum container throughput. Upon arrival at the port, the vessel will be assigned to a berthing position, where the offload and upload operations of containers are performed. Following the assignment of a berth, the vessel's containers are discharged by assigned QCs according to a work schedule, and distributed to one of the storage blocks in the yard. The containers are then delivered by internal transportation to truck and train operation areas, where the containers are loaded onto trucks and/or trains to be transported to desired destinations. The operations that take place before the container reaches the storage yard are referred to as quayside operations, as they take place near the quay of the container terminal. Operations taking place on the yard, where containers are stacked and stored, are known as yard side operations. The cost of constructing berths and operating equipment such as the QCs is extremely high. Therefore, …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Addressing a Coordinated Quay Crane Scheduling and Assignment Problem by Red Deer Algorithm

Nowadays, there is much attention for planning of container terminals in the global trade centers. The high cost of quay cranes motivates both scholars and industrial practitioners especially in the last decade to develop novel optimization models to address this dilemma. This study proposes a coordinated optimization model to cover both Quay Crane Scheduling Problem (QCSP) and Quay Crane Assig...

متن کامل

Quay Cranes and Yard Trucks Scheduling Problem at Container Terminals

A bi-objective mathematical model is developed to simultaneously consider the quay crane and yard truck scheduling problems at container terminals. Main real-world assumptions, such as quay cranes with non-crossing constraints, quay cranes’ safety margins and precedence constraints are considered in this model. This integrated approach leads to better efficiency and productivity at container te...

متن کامل

A Mathematical Model and Grouping Imperialist Competitive Algorithm for Integrated Quay Crane and Yard Truck Scheduling Problem with Non-crossing Constraint

In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, thi...

متن کامل

A new multi-objective model for berth allocation and quay crane assignment problem with speed optimization and air emission considerations (A case study of Rajaee Port in Iran)

Over the past two decades, maritime transportation and container traffic worldwide has experienced rapid and continuous growth. With the increase in maritime transportation volume, the issue of greenhouse gas (GHG) emission has become one of the new concerns for port managers. Port managers and government agencies for sustainable development of maritime transportation considered "green ports" t...

متن کامل

A modified generalized extremal optimization algorithm for the quay crane scheduling problem with interference constraints

The quay crane scheduling problem (QCSP) determines the handling sequence of tasks at ship bays by a set of cranes assigned to a container vessel such that the vessel’s service time is minimized. A number of heuristics or metaheuristics have been proposed to obtain the near-optimal solutions to overcome the NP-hardness of the problem. In this article, the idea of generalized extremal optimizati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Expert Syst. Appl.

دوره 41  شماره 

صفحات  -

تاریخ انتشار 2014